Generating Robust Partial Order Schedules
نویسندگان
چکیده
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. Whereas a fixed-times schedule is brittle in the face of unpredictable execution dynamics and can quickly become invalidated, a POS retains temporal flexibility whenever problem constraints allow it and can often absorb unexpected deviation from predictive assumptions. We focus specifically on procedures for generating Chaining Form POSs, wherein activities competing for the same resources are linked into precedence chains. One interesting property of a Chaining Form POS is that it is “makespan preserving” with respect to its originating fixed-times schedule. Thus, issues of maximizing schedule quality and maximizing schedule robustness can be addressed sequentially in a two-step scheduling procedure. Using this approach, a simple chaining algorithm was recently shown to provide an effective basis for transforming good quality solutions into POSs with good robustness properties. Here, we investigate the possibility of producing POSs with better robustness and stability properties through more extended search in the space of Chaining Form POSs. We define two heuristics which make use of a structural property of chaining form POSs to bias chaining decisions. Experimental results on a resource-constrained project scheduling benchmark confirm the effectiveness of our approach.
منابع مشابه
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
Constraint-based approaches to scheduling have typically formulated the problem as one of finding a consistent assignment of start times for each goal activity. In contrast, we are pursuing an approach that operates with a problem formulation more akin to least-commitment frameworks, where the objective is to post sufficient additional precedence constraints between pairs of activities contendi...
متن کاملSchedule robustness through Solve-and-Robustify: generating flexible schedules from different fixed-time solutions
In previous works the authors have defined Solve-andRobustify an original two-step procedure to generate flexible solutions, or partial order schedules, for schedulingproblems. The partition in two steps — first find a solution then make it robust — not only represents a way to generate flexible, robust schedules but is also an alternative to achieve good quality solutions. This paper extends t...
متن کاملA New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study
This paper considers a scheduling problem with uncertain processing times and machine breakdowns in industriall/office workplaces and solves it via a novel robust optimization method. In the traditional robust optimization, the solution robustness is maintained only for a specific set of scenarios, which may worsen the situation for new scenarios. Thus, a two-stage predictive algorithm is prop...
متن کاملGenerating Robust Schedules through Temporal Flexibility
This paper considers the problem of generating partial order schedules (POS), that is, schedules which retain temporal flexibility and thus provide some degree of robustness in the face of unpredictable execution circumstances. We begin by proposing a set of measures for assessing and comparing the robustness properties of alternative POSs. Then, using a common solving framework, we develop two...
متن کاملPartial-Order Support-Link Scheduling
Partial-order schedules are valued because they are flexible, and therefore more robust to unexpected delays. Previous work has indicated that constructing partial-order schedules by a two-stage method, in which a fixed-time schedule is first found and a partial order then lifted from it, is far more efficient than constructing them directly by a least-commitment partial-order scheduling algori...
متن کاملRobust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from scenario-based or stochastic programming approaches often used to tackle uncertainty. Given a value 0 < ≤ 1, we are interested to know what the robust objective value is, i.e. the optimal value if we allow an chance of no...
متن کامل